Order optimal information spreading using algebraic gossip
نویسندگان
چکیده
منابع مشابه
On Collaborative Information Spreading via Randomized Gossip
P2P networks are becoming increasingly used for wide-scale collaborative information spreading over the Internet. Thus, the ability to share information with large group of network nodes at near-optimal cost may be the one step that will allow P2P networks to replace traditional broadcast. For large groups, there are substantial inefficiencies that result from using deterministic tree-based app...
متن کاملGossip - based Information Spreading in Mobile and Social Networks
HUANG, YUFAN. Gossip-based Information Spreading in Mobile and Social Networks. (Under the direction of Dr. Huaiyu Dai.) We study the performance of gossip-based information spreading in different network models. Our study is conducted in two major different circumstances: mobile networks and social networks. In mobile networks, we mainly study two problems: single-piece information spreading w...
متن کاملSpreading gossip in social networks.
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal reachability of the neighbors of a given node that interchange information among each other, and the spreading time needed for the information to reach such a fraction of nodes. When the information refers to a particular node at which...
متن کاملAlgebraic gossip on Arbitrary Networks
Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied in [4] where a bound to the dissemination time based on the spectral properties of the underlying communication graph is provided. Our contribution is a uniform bound that hold...
متن کاملBounds for algebraic gossip on graphs
We study the stopping times of gossip algorithms fornetwork coding. We analyze algebraic gossip (i.e., random linearcoding) and consider three gossip algorithms for informationspreading: Pull, Push, and Exchange. The stopping time ofalgebraic gossip is known to be linear for the complete graph, butthe question of determining a tight upper bound or lower boundsfor general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2013
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-013-0187-y